On the construction of turbo code interleavers based on graphs with large girth
نویسنده
چکیده
We discuss how interleavers for parallel concatenated turbo codes with good minimum distance can be derived from graphs having large girth, i.e. graphs whose length of the shortest cycle is large.
منابع مشابه
Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs
In this letter we present a new construction of interleavers for turbo codes from 3-regular Hamiltonian graphs. The interleavers can be generated using a few parameters, which can be selected in such a way that the girth of the interleaver graph (IG) becomes large, inducing a high summary distance. The size of the search space for these parameters is derived. The proposed interleavers themselve...
متن کاملA New Construction for LDPC Codes using Permutation Polynomials over Integer Rings
A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes have both algebraic and pseudorandom nature, and the new codes are quasi-cyclic. Graph isomorphisms and automorphisms are identified and used in an efficient search for good codes. Graphs with girth as large as 12 wer...
متن کاملNew Code Construction Method and High-Speed VLSI Codec Architecture for Repeat-Accumulate Codes
Repeat-Accumulate code has been widely used in various practical communication systems due to its special structure that can be encoded with a low complexity turbo-like encoder and decoded with a high-speed parallel algorithm. However, the construction of RA codes with large girth is still a challenging problem. In this paper, the girth upper bound of RA codes is analyzed and a novel RA code co...
متن کاملExplicit Construction of Families of LDPC Codes with Girth at Least Six
LDPC codes are serious contenders to Turbo codes in terms of decoding performance. One of the main problems is to give an explicit construction of such codes whose Tanner graphs have known girth. For a prime power q and m ≥ 2, Lazebnik and Ustimenko construct a q-regular bipartite graph D(m, q) on 2qm vertices, which has girth at least 2dm/2e+ 4. We regard these graphs as Tanner graphs of binar...
متن کاملQuadratic Permutation Polynomial Interleavers for 3gpp Lte Turbo Codes
The contention-free property of interleavers is one of the key design requirements for the parallel decoding implementations of turbo codes in order to achieve high decoding throughput. Quadratic permutation polynomial (QPP) interleavers are maximum contention-free (MCF), i.e., every factor dividing the interleaver length becomes a possible degree of parallel decoding processing without any mem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002